A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
نویسندگان
چکیده
منابع مشابه
A Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier
This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...
متن کاملFeedback Algorithm for the Single-Facility Minisum Problem
A new accelerated algorithm to solve the single-facility minisum location problem is developed. The acceleration is achieved using a feedback factor. The proposed algorithm converges faster than the accelerating procedures available in the literature. Being nearly as simple as the classical Weiszfeld procedure, the new method can easily be implemented in real applications. Practical subroutines...
متن کاملA Facility Location Problem under Competition
We consider a generalization of the discrete Voronoi game, in which consumers with positive purchase power who are located on the vertices of a network wish to connect to the nearest facility. Knowing this, competitive players locate their facilities on vertices, trying to capture the largest possible market share. We study conditions that guarantee the existence of a pure strategy Nash equilib...
متن کاملApplying queuing theory for a reliable integrated location –inventory problem under facility disruption risks
This study considers a reliable location – inventory problem for a supply chain system comprising one supplier, multiple distribution centers (DCs), and multiple retailers in which we determine DCs location, inventory replenishment decisions and assignment retailers to DCs, simultaneously. Each DC is managed through a continuous review (S, Q) inventory policy. For tackling real world conditions...
متن کاملSequential Competitive Facility Location Problem in a Discrete Planar Space
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1997
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.40.10